منابع مشابه
A Study of Adaptive Gossip Routing in Wireless Mesh Networks
Gossip routing is an approach to limit the overhead of flooding in wireless networks. Each node, that receives a packet that would normally be flooded, applies a probabilistic approach. The packet is either forwarded with probability p or dropped with 1 − p. This paper is a follow-up to our last study that evaluated the approaches by Haas et al. in the DES-Testbed, a wireless mesh network. Four...
متن کاملRegional Gossip Routing for Wireless Ad Hoc Networks
Many routing protocols have been proposed for wireless ad hoc networks, and most of them are based on some variants of flooding. Thus many routing messages are propagated through the network unnecessarily despite various optimizations. Gossip based routing method has been used and re-investigated to reduce the number of messages in both wired networks and wireless ad hoc networks. However, the ...
متن کاملGossip Based Routing Protocol Design for Ad Hoc Networks
A spontaneously mannered decentralized network with no formal infrastructure and limited in temporal and spatial extent where each node communicate with each other over a wireless channel and is willing to forward data for other nodes is called as Wireless Ad Hoc network. In this research study, we proposed a routing strategy based on gossip based routing approach that follows the proactive rou...
متن کاملOptimal Routing in Toroidal Networks
In this paper we study routing algorithms for one-to-one communication in multi-processors, whose interconnection networks have toroidal structure. A toroidal network is an n-dimensional rectangular mesh with additional edge-to-edge connections. Mathematically speaking, these networks are undirected graphs obtained by cartesian product of cycles. We show, that a broad class of routing algorithm...
متن کاملOptimal routing on complex networks
We present a novel heuristic algorithm for routing optimization on complex networks. Previously proposed routing optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to queuing overload. By usin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 2005
ISSN: 0018-9545
DOI: 10.1109/tvt.2005.851351